Search results for "Penalty method"
showing 10 items of 15 documents
Regularized LMS methods for baseline wandering removal in wearable ECG devices
2016
The acquisition of electrocardiogram (ECG) signals by means of light and reduced size devices can be usefully exploited in several health-care applications, e.g., in remote monitoring of patients. ECG signals, however, are affected by several artifacts due to noise and other disturbances. One of the major ECG degradation is represented by the baseline wandering (BW), a slowly varying change of the signal trend. Several BW removal algorithms have been proposed into the literature, even though their complexity often hinders their implementation into wearable devices characterized by limited computational and memory resources. In this study, we formalize the BW removal problem as a mean-square…
Cohesive Model for the Simulation of Crack Initiation and Propagation in Mixed-Mode I/II in Composite Materials
2019
A cohesive element able to connect and simulate crack growth between independently modeled finite element subdomains with non-matching meshes is proposed and validated. The approach is based on penalty constraints and has several advantages over conventional FE techniques in disconnecting two regions of a model during crack growth. The most important is the ability to release portion of the interface that are smaller than the local finite element length. Thus, the growth of delamination is not limited to advancing by releasing nodes of the FE model, which is a limitation common to the methods found in the literature. Furthermore, it is possible to vary the penalty parameter within the cohes…
Black box scatter search for general classes of binary optimization problems
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is made between two sets of general constraint types that are handled directly by the solver and other constraints that are addressed via penalty functions. In both cases, however, the heuristic treats the objective function evaluation as a black box. We perform computational experiments with four well-k…
A High-Resolution Penalization Method for large Mach number Flows in the presence of Obstacles
2009
International audience; A penalization method is applied to model the interaction of large Mach number compressible flows with obstacles. A supplementary term is added to the compressible Navier-Stokes system, seeking to simulate the effect of the Brinkman-penalization technique used in incompressible flow simulations including obstacles. We present a computational study comparing numerical results obtained with this method to theoretical results and to simulations with Fluent software. Our work indicates that this technique can be very promising in applications to complex flows.
Regularized pseudopotential for mean-field calculations
2019
We present preliminary results obtained with a finite-range two-body pseudopotential complemented with zero-range spin-orbit and density-dependent terms. After discussing the penalty function used to adjust parameters, we discuss predictions for binding energies of spherical nuclei calculated at the mean-field level, and we compare them with those obtained using the standard Gogny D1S finite-range effective interaction.
Dynamic Computation Offloading Scheme for Fog Computing System with Energy Harvesting Devices
2020
Fog computing is considered as a promising technology to meet the ever-increasing computation requests from a wide variety of mobile applications. By offloading the computation-intensive requests to the fog node or the central cloud, the performance of the applications, such as energy consumption and delay, are able to be significantly enhanced. Meanwhile, utilizing the recent advances of social network and energy harvesting techniques, the system performance could be further improved. In this paper, we take the social relationships of the energy harvesting MDs into the design of computational offloading scheme in fog computing. With the objective to minimize the social group execution cost…
A penalty-based finite element interface technology
2002
Abstract An effective and robust interface element technology able to connect independently modeled finite element subdomains is presented. This method has been developed using the penalty constraints and allows coupling of finite element models whose nodes do not coincide along their common interface. Additionally, the present formulation leads to a computational approach that is very efficient and completely compatible with existing commercial software. A significant effort has been directed toward identifying those model characteristics (element geometric properties, material properties and loads) that most strongly affect the required penalty parameter, and subsequently to developing si…
A variational inequality approach to constrained control problems for parabolic equations
1988
A distributed optimal control problem for parabolic systems with constraints in state is considered. The problem is transformed to control problem without constraints but for systems governed by parabolic variational inequalities. The new formulation presented enables the efficient use of a standard gradient method for numerically solving the problem in question. Comparison with a standard penalty method as well as numerical examples are given.
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
2010
In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instance…
Efficient numerical methods for pricing American options under stochastic volatility
2007
Five numerical methods for pricing American put options under Heston's stochastic volatility model are described and compared. The option prices are obtained as the solution of a two-dimensional parabolic partial differential inequality. A finite difference discretization on nonuniform grids leading to linear complementarity problems with M-matrices is proposed. The projected SOR, a projected multigrid method, an operator splitting method, a penalty method, and a componentwise splitting method are considered. The last one is a direct method while all other methods are iterative. The resulting systems of linear equations in the operator splitting method and in the penalty method are solved u…